How to predict color?
نویسندگان
چکیده
منابع مشابه
Using recovered reflectance to predict color
Predicting a surface color under different lights is an easy task if the surface reflectance function is available. However, often only colorimetric information is available, and the tristimulus values of a color that undergoes an illuminant change are estimated using transforms inspired by the von Kries coefficient rule model. We propose a new method, based on the reconstruction of multispectr...
متن کاملHow to Predict Congruential Generators
In this paper we show how to predict a large class of pseudorandom number generators. We consider congruential generators which output a sequence of integers k SO.Sl,... where si is computed by the recurrence si r I: ai @j(so,sl,...Si_l) (mod ml for j=l integers m and Ctj , and integer functions @j , j=l,...,k. Our predictors are @cient, provided that the jimctions Oj are computable (over the i...
متن کاملMicroRNA Targets - How to predict?
A number of web tools are available for the prediction and identification of target microRNAs (miRNAs). The choice, availability, validity and selection of an optimal yet appropriate tool are a challenge for the design of high throughput assays with promising miRNA targets. The current trends and challenges for target microRNAs (miRNAs) prediction, identification and selection is described in t...
متن کاملHow To Color A Map
We study the maximum differential coloring problem, where an n-vertex graph must be colored with colors numbered 1, 2...n such that the minimal difference between the two colors of any edge is maximized. This problem is motivated by coloring maps in which not all countries are contiguous. Since it is known that this problem is NP-hard for general graphs; we consider planar graphs and subclasses...
متن کاملHow to color shift hypergraphs
Let g(k) denote the minimum integer m so that for every set S of m integers there is a k-coloring of the set of all integers so that every translate of S meets every color class. It is a well known consequence of the Local Lemma that g(k) is finite for all k. Here we present a new proof for this fact, that yields a very efficient parallel algorithm for finding, for a given set S, a coloring as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Человек и культура
سال: 2020
ISSN: 2409-8744
DOI: 10.25136/2409-8744.2020.6.33036